Stepwise Assertional Design of Distance-Vector Routing Algorithms
نویسندگان
چکیده
There are many kinds of distance{vector algorithms for adaptive routing in wide{area computer networks, ranging from the classical Distributed Bellman{Ford to several recent algorithms that have better performance. However, these algorithms have very complicated behaviors and their analyses in the literature has been incomplete (and operational). In this paper, we present a stepwise assertional design of a recently proposed distance{vector algorithm. Our design starts with the Distributed Bellman{Ford and goes through two intermediate algorithms. The properties established for each algorithm hold for the succeeding algorithms. The algorithms analyzed here are representative of various internetwork routing protocols.
منابع مشابه
Reducing the scope of denial of service attacks in QoS routing
Existing routing algorithms treat Quality of Service (QoS) parameters and secure routing as completely separate entities requiring separate algorithms. In this paper we propose secure QoS Distance Vector and secure Bellman-Ford-Moore routing algorithms that meet QoS requirements and satisfy security concerns. Security is achieved by placing filters in the network. The routing algorithms generat...
متن کاملPerformance issues on AODV and AOMDV
One of the main challenges of MANET is the design of robust routing algorithms that adapt to the frequent and randomly changing network topology. A variety of routing protocols have been proposed and several have been extensively simulated. In this paper, we compare and evaluate the performance of two types of On demand routing protocolsAd-hoc On-demand Distance Vector (AODV) routing protocol, ...
متن کاملPerformance Analysis Between Distance Vector Algorithm (DVA) & Link State Algorithm (LSA) For Routing Network
In this paper, we survey the public presentation between two adaptive routing algorithms: Link state algorithm (LSA), which is centralized algorithm and Distance vector algorithm (DVA), which is distributed algorithm. The primary purpose of this paper is to compare two dynamic routing algorithms. Besides, we represent an overview of these algorithms distinguish similarities and differences betw...
متن کاملLoop-free Distance Vector Routing to Avoid Count-to-infinity
The proposed Loop-free Distance Vector Routing (LFDVR) is a distributed dynamic routing, derived from the famous Bellman Ford’s Distance Vector Routing Algorithm (BFDVRA) which is widely used in the Internet and private intranets. Several routing protocols based on distance-vector algorithms have been proposed like Routing Information Protocol (RIP), Gateway-to-Gateway Protocol (GGP) and Exteri...
متن کاملA Routing Algorithm for Wireless Ad Hoc Networks with Unidirectional Links
Most of the routing algorithms for ad hoc networks assume that all wireless links are bidirectional. In reality, some links may be unidirectional. In this paper we show that the presence of such links can jeopardize the performance of the existing distance vector routing algorithms. We also present modi cations to distance vector based routing algorithms to make them work in ad hoc networks wit...
متن کامل